1934A - Too Min Too Max - CodeForces Solution

#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define fastio()          \ 
ios_base::sync_with_stdio(false);\ 
    cin.tie(NULL);       \ 
   cout.tie(__null);
using namespace std;
void sol()
{
    int n;
    cin >> n;
    int a[n];
    for(int i=0;i<n;++i){
        cin>>a[i];
    }
    sort(a,a+n);
    int i=a[0],k=a[1],l=a[n-1],j=a[n-2];
    int ans=abs(i-j)+abs(j-k)+abs(k-l)+abs(l-i);
    cout<<ans<<endl;
}
signed main()
{
    fastio()
        int t;
    t = 1;
    cin >> t;
    while (t--)
        sol();
    return 0;
}